Well-tuned algorithms for the Team Orienteering Problem with Time Windows
نویسندگان
چکیده
منابع مشابه
Well-tuned algorithms for the Team Orienteering Problem with Time Windows
The Team Orienteering Problem with Time Windows (TOPTW) is the extension of the Orienteering Problem (OP) where each node is limited by a predefined time window during which the service has to start. The objective of the TOPTW is to maximize the total collected score by visiting a set of nodes with a limited number of paths. We propose two algorithms, Iterated Local Search and a hybridization o...
متن کاملWell-Tuned ILS for Extended Team Orienteering Problem with Time Windows
The Team Orienteering Problem with Time Windows (TOPTW) is the extension of the Team Orienteering Problem (TOP) by incorporating the time window constraints. Given a set of nodes including their scores, service times and time windows, the goal is to maximize the total of scores collected by a fixed number of routes considering a predefined time window during which the service has to start. In t...
متن کاملThe Multiconstraint Team Orienteering Problem with Multiple Time Windows
The Orienteering Problem (OP) is a combinatorial routing problem of which the goal is to find a tour that maximises the total score earned by visiting vertices. A set of vertices is given, determined by their coordinates and a score. The pairwise travel times between the vertices are known. The total travel time should not exceed a predetermined time budget. Each vertex can be visited at most o...
متن کاملSolving multi-objective team orienteering problem with time windows using adjustment iterated local search
One of the problems tourism faces is how to make itineraries more effective and efficient. This research has solved the routing problem with the objective of maximizing the score and minimizing the time needed for the tourist’s itinerary. Maximizing the score means collecting a maximum of various kinds of score from each destination that is visited. The profits differ according to whether those...
متن کاملApproximation Algorithms for Orienteering with Time Windows
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T , find an s-t walk of total length at most T that maximizes the number of distinct nodes visited by the walk. One obtains a generalization, namely orienteering with time-windows (also referred to as TSP with time-windows), if each node v has a specified ti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operational Research Society
سال: 2017
ISSN: 0160-5682,1476-9360
DOI: 10.1057/s41274-017-0244-1